Errors in Improved Polynomial Algorithm For 3 Sat Proposed By Narendra Chaudhari

There are errors in the algorithm proposed by Narendra Chaudhari [2] purporting to solve the 3-sat problem in polynomial time. The present paper presents an instance for which the algorithm outputs erroneous results. Introduction: In his paper [1], Narendra Chaudhari describes an algorithm to find a solution for the 3-sat problem in polynomial time. In a second paper [2], he improves on his previous algorithm. The following paper describes two instances of the 3-sat problem on which the improved algorithm fails to give the expected output.